Proportional Cake-Cutting among Families
نویسندگان
چکیده
The classic cake-cutting problem is extended from individual agents to groups of agents. Applications include dividing a land-estate among families or dividing disputed lands among states. In the standard cake-cutting model, each agent should receive an individual subset of the cake with a sufficiently high individual value. In our model, each group should receive a subset with a sufficiently high ”group value”. Six ways to define the aggregate group value based on the values of the group members are examined: four based on cardinal welfare functions and two based on ordinal preference relations. Our results show that the choice of the group value function has crucial implications on the existence and applicability of fair division protocols. JEL classification: D63
منابع مشابه
Resource-monotonicity and Population-monotonicity in Cake-cutting
We study the monotonicity properties of solutions in the classic problem of fair cake-cutting — dividing a heterogeneous resource among agents with different preferences. Resourceand population-monotonicity relate to scenarios where the cake, or the number of participants who divide the cake, changes. It is required that the utility of all participants change in the same direction: either all o...
متن کاملResource-monotonicity and Population-monotonicity in Connected Cake-cutting
In the classic cake-cutting problem (Steinhaus, 1948), a heterogeneous resource has to be divided among n agents with different valuations in a proportional way — giving each agent a piece with a value of at least 1/n of the total. In many applications, such as dividing a land-estate or a time-interval, it is also important that the pieces are connected. We propose two additional requirements: ...
متن کاملThe complexity of cake cutting with unequal shares
An unceasing problem of our prevailing society is the fair division of goods. The problem of fair cake cutting is dividing a heterogeneous and divisible resource, the cake, among n players who value pieces according to their own measure function. The goal is to assign each player a not necessarily connected part of the cake that the player evaluates at least as much as her proportional share. I...
متن کاملOn the Complexity of Chore Division
We study the proportional chore division problem where a protocol wants to divide a negatively valued object, called chore, among n different players. The goal is to find an allocation such that cost of the chore assigned to each player be at most 1/n of the total cost. This problem is the dual variant of the cake cutting problem in which we want to allocate a desirable object. Edmonds and Pruh...
متن کاملEquilibrium analysis in cake cutting
Cake cutting is a fundamental model in fair division; it represents the problem of fairly allocating a heterogeneous divisible good among agents with different preferences. The central criteria of fairness are proportionality and envy-freeness, and many of the existing protocols are designed to guarantee proportional or envy-free allocations, when the participating agents follow the protocol. H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015